Mining Least Relational Patterns from Multi Relational Tables
نویسندگان
چکیده
Existing mining association rules in relational tables only focus on discovering the relationship among large data items in a database. However, association rule for significant rare items that appear infrequently in a database but are highly related with other items is yet to be discovered. In this paper, we propose an algorithm called Extraction Least Pattern (ELP) algorithm that using a couple of predefined minimum support thresholds. Results from the implementation reveal that the algorithm is capable of mining rare item in multi relational tables.
منابع مشابه
An efficient approach for effectual mining of relational patterns from multi-relational database
Data mining is an extremely challenging and hopeful research topic due to its well-built application potential and the broad accessibility of the massive quantities of data in databases. Still, the rising significance of data mining in practical real world necessitates ever more complicated solutions while data includes of a huge amount of records which may be stored in various tables of a rela...
متن کاملMulti Relational Data Mining Approaches: A Data Mining Technique
The multi relational data mining approach has developed as an alternative way for handling the structured data such that RDBMS. This will provides the mining in multiple tables directly. In MRDM the patterns are available in multiple tables (relations) from a relational database. As the data are available over the many tables which will affect the many problems in the practice of the data minin...
متن کاملState of Art of Multi Relational Data Mining Approaches: A Rule Mining Algorithm
In this 21 century is completely called as the information science where the large organizations need useful knowledge. The data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. The ...
متن کاملMulti-Relational Data Mining A Comprehensive Survey
Multi-Relational Data Mining or MRDM is a growing research area focuses on discovering hidden patterns and useful knowledge from relational databases. While the vast majority of data mining algorithms and techniques look for patterns in a flat single-table data representation, the sub-domain of MRDM looks for patterns that involve multiple tables (relations) from a relational database. This sub...
متن کاملMulti Relational Data Mining Classification Processions – A Survey
This paper commences with the introduction of multi relational data mining, which is an area widely explored nowadays because of its fruitfulness across a wide spectrum of applications. Data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table(propositionalisation), multi-relational data mining(MRDM) approaches look for...
متن کامل